Cyclic codes over $\mathbb{Z}_{4}+u\mathbb{Z}_{4}+u^{2}\mathbb{Z}_{4}$

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Skew Cyclic Codes over a Finite Ring

In this paper, we classify the skew cyclic codes over Fp + vF_p + v^2F_p, where p is a prime number and v^3 = v. Each skew cyclic code is a F_p+vF_p+v^2F_p-submodule of the (F_p+vF_p+v^2F_p)[x;alpha], where v^3 = v and alpha(v) = -v. Also, we give an explicit forms for the generator of these codes. Moreover, an algorithm of encoding and decoding for these codes is presented.

متن کامل

On cyclic codes and quasi-cyclic codes over Zq + uZq

Let R = Zq + uZq, where q = p and u = 0. In this paper, some structural properties of cyclic codes and quasi-cyclic (QC) codes over the ring R are considered. A QC code of length ln with index l over R is viewed both as in the conventional row circulant form and also as an R[x]/(x − 1)-submodule of GR(R, l)[x]/(x − 1), where GR(R, l) is the Galois extension ring of degree l over R. A necessary ...

متن کامل

Cyclic Codes and Self-Dual Codes Over

We introduce linear cyclic codes over the ring F 2 + uF 2 = f0; 1; u; u = u + 1g, where u = 0 and study them by analogy with the Z4 case. We give the structure of these codes on this new alphabet. Self-dual codes of odd length exist as in the case of Z4-codes. Unlike the Z4 case, here free codes are not interesting. Some nonfree codes give rise to optimal binary linear codes and extremal self-d...

متن کامل

$\Theta_S-$cyclic codes over $A_k$

We study ΘS−cyclic codes over the family of rings Ak. We characterize ΘS−cyclic codes in terms of their binary images. A family of Hermitian inner-products is defined and we prove that if a code is ΘS−cyclic then its Hermitian dual is also ΘS−cyclic. Finally, we give constructions of ΘS−cyclic codes. ∗Corresponding author. email: [email protected]

متن کامل

Cyclic codes over finite rings

It is well known that cyclic linear codes of length n over a (finite) field F can be characterized in terms of the factors of the polynomial x"-1 in F[x]. This paper investigates cyclic linear codes over arbitrary (not necessarily commutative) finite tings and proves the above characterization to be true for a large class of such codes over these rings. (~) 1997 Elsevier Science B.V. All rights...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: TURKISH JOURNAL OF MATHEMATICS

سال: 2017

ISSN: 1300-0098,1303-6149

DOI: 10.3906/mat-1602-35